Assertion-based slicing and slice graphs

Assertion-based Analysis via Slicing with ABETS (System Description)

We present ABETS, an assertion-based, dynamic analyzer that helps diagnose errors in Maude programs. ABETS uses slicing to automatically create reduced versions of both a run’s execution trace and executed program, reduced versions in which any information that is not relevant to the bug currently being diagnosed is removed. In addition, ABETS employs runtime assertion checking to automate the ...

Reasoning about GSTE Assertion Graphs

A Transformation-Based Approach to Implication of GSTE Assertion Graphs

Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to themodel checking of ω-regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata...

Dynamic Assertion and Retraction of Conceptual Graphs

This paper proposes an extension to conceptual graphs that captures dynamic aspects of knowledge. This extension is necessary, because some kinds of temporal notions are not effectively represented by conceptual graphs containing only concepts, relations and actors [Sowa84]. The following work is based on the belief that a fundamental extension to conceptual graphs is needed that captures the t...

And-Or Dependence Graphs for Slicing Statecharts

The construction of an And-Or dependence graphs is illustrated, and its use in slicing statecharts is described. The additional structure allows for more precise slices to be constructed in the event of additional information, such as may be provided by static analysis and model checking, and with constraints on the global state and external events.